A permission-dependent type system for secure information flow analysis

We introduce a novel type system for enforcing secure information flow in an imperative language. Our work is motivated by the problem of statically checking potential leakage Android applications. To this end, we design lightweight featuring permission model, where permissions are assigned to applications and used enforce access control take inspiration from Banerjee Naumann allow security types be dependent on A feature our typing rule conditional branching induced testing, which introduces merging operator types, allowing more precise policies enforced. The soundness proved with respect non-interference. inference algorithm also presented underlying system, reducing constraint solving lattice types. In addition, new way represent as reduced ordered binary decision diagrams proposed.